On Dynamic Vehicle Routing With Time Constraints
نویسندگان
چکیده
منابع مشابه
Study on Dynamic Vehicle Routing Problem with Time Windows
In the context of information technology, efficient and reliable logistics are a key factor for the economic success of online shops, This necessarily requires an effective way to plan goods delivery to improve efficient and speed, the most important and widely studied combinatorial optimization problems, which continue to draw attention from researchers is the vehicle routing problem, which ca...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملCustomer satisfaction in dynamic vehicle routing problem with time windows
The dynamic vehicle routing and scheduling problem is a well-known complex combinatorial optimization problem that drew significant attention over the past few years. This paper presents a novel algorithm introducing a new strategy to integrate anticipated future visit requests during plan generation, aimed vailable online xxx eywords: enetic algorithms ustomer satisfaction at explicitly improv...
متن کاملLogistics Optimization: Vehicle Routing with Loading Constraints
In today’s global markets, enterprises are integrated in order to produce value for the end customers: this network is referred as Supply Chain (SC). Transportation Management (TM) is one of the SC processes. TM decisions include, among others, load planning (referred as Container Loading Problem CLP) and delivery route planning (referred as Vehicle Routing Problem VRP). Several authors address...
متن کاملA Survey on the Progress of Research on Vehicle Routing Problem with Time Window Constraints
This paper summarizes a survey of literatures based on M. Solomon’s original benchmark problem statement for Vehicle Routing Problem with Time Window Constraint (VRPTW). The survey aims to summarize the progress and evolution of the problem statement as the years go by. We have seen many improvements on the performance of the optimization to the problem from many different algorithms like Genet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Robotics
سال: 2014
ISSN: 1552-3098,1941-0468
DOI: 10.1109/tro.2014.2344451